|
| |
|
|
Coalition Formation in Multiagent Systems Using Genetic Algorithms
Kučera, Tomáš ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis discusses the basics of software agents and the way they form the multiagent coalitions. Genetic algorithms are introduced as one of the methods of solving the coalition formation problem. MAPC 2018 competition is introduced, which inspired the final design and implementation of the solution by using the tools described. A demo project was created, in which agents communicate with the MASSim server and gather data which is then used as an input into the genetic algorithm. Its purpose is to assign the agents to the tasks based on the input data, so that the tasks can be accomplished in the most effective manner possible. The results of this algorithm are evaluated in experiments which are focused on the quality of the solutions found as well as the time required for the calculation.
|
|
|
Discrete Simulation of Programmable Systems
Mynář, Pavel ; Zuzaňák, Jiří (referee) ; Mlích, Jozef (advisor)
The subject of this thesis is the design and implementation of software library for discrete simulation of programmable units and their mutual communication and implementation of several illustrative examples based on it. The library is designed to be platform independent and as robust and simple to use as possible.
|
|
|
Intelligent Autopilot Based on Agent-Oriented Programming
Burda, Radek ; Samek, Jan (referee) ; Zbořil, František (advisor)
Thesis aims at fighter combat and maneuvring - so called Dogfighting. The purpose of this work is to create intelligent autopilot based on Agent system, eligible of executing in-air maneuvers and tactics in real-time simulation. In the first part, theoretical basis of air combat will be introduced, such as weapon systems, maneuvring and tactics in mutual combat 1 on 1, odds fight 2 on 1, and last but not least mass fights. Also agent programming will be introduced, as well as recognizing of agent rules and processes and its transformation to agent language. The second part describes building of a simple graphical simulation environment based on JMonkey game engine. Agent system maintaining every single aircraft within the simulation will be created and own network socket protocol for communication between intelligent behavior and simulation environment will be discussed and documented.
|
|
|
Intelligent Client for Music Player Daemon
Wagner, Tomáš ; Kočí, Radek (referee) ; Janoušek, Vladimír (advisor)
The content of this master thesis project is about design and implementation of intelligent client application for Music Player Daemon (MPD), which searches and presents the metadata related to played content. The actual design precedes the theoretical analysis, which includes analysis of agent systems, methods of data classification, web communication protocols and languages for describing HTML document. At the same time is analyzed the MPD server and communication protocol used by clients application. Furthermore, this work describes the current client applications that presents metadata. In the last chapters of the thesis describes the design and implementation of intelligent client. It describes the methods of solution the implementation and solution of problems. Lastest chapters describes the testing result.
|
|
| |
|
|
Strategy Game with Intelligent Elements
Snášel, Lukáš ; Samek, Jan (referee) ; Zbořil, František (advisor)
The aim of this thesis is to design a self-functional system, which will be capable to reach its own goals by taking advance of the game theory and the multiagent systems. As a presentation of this system there is a strategical fighting game with graphics drawn by DirectX9 and implemented in C++ programming language. The main goal was to design suitable search, schedule and decision-making algorithms
|
|
|
Cooperation of Multiagent Group in Dynamic Environment
Balajka, Pavel ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The thesis summarises thorough analysis of rules and mechanisms of Multiagent Contest for year 2020 followed by design of multiagent group which will try to succeed in a simulation of the mentioned contest with the best results. The design was created according to the Prometheus metodology from general view (scenarios, goals) to specific details (agent plans, messages). Implementation is realized through JaCaMo system, which is also briefly described in this paper. Then the pros and cons of JaCaMo system are analyzed. Lastly the implemented solution of this work is compared with other teams that participated in the mentioned agent competition this year.
|
|
|
Cooperation of Multiagent Group in Dynamic Environment
Balajka, Pavel ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
The thesis summarises thorough analysis of rules and mechanisms of Multiagent Contest for year 2020 followed by design of multiagent group which will try to succeed in a simulation of the mentioned contest with the best results. The design was created according to the Prometheus metodology from general view (scenarios, goals) to specific details (agent plans, messages). Implementation is realized through JaCaMo system, which is also briefly described in this paper. Then the pros and cons of JaCaMo system are analyzed. Lastly the implemented solution of this work is compared with other teams that participated in the mentioned agent competition this year.
|
|
|
Coalition Formation in Multiagent Systems Using Genetic Algorithms
Kučera, Tomáš ; Uhlíř, Václav (referee) ; Zbořil, František (advisor)
This thesis discusses the basics of software agents and the way they form the multiagent coalitions. Genetic algorithms are introduced as one of the methods of solving the coalition formation problem. MAPC 2018 competition is introduced, which inspired the final design and implementation of the solution by using the tools described. A demo project was created, in which agents communicate with the MASSim server and gather data which is then used as an input into the genetic algorithm. Its purpose is to assign the agents to the tasks based on the input data, so that the tasks can be accomplished in the most effective manner possible. The results of this algorithm are evaluated in experiments which are focused on the quality of the solutions found as well as the time required for the calculation.
|
guest ::
